On Maximizing Coverage in Gaussian Relay Channels
نویسندگان
چکیده
منابع مشابه
On the Capacity of Gaussian Relay Channels
Determining the capacity of Gaussian relay channels even with one relaying station has been an open problem for several decades. This paper presents a pair of upper and lower bounds whose gap is no more than 0.5 bit per channel use, for the capacity of Gaussian relay channels with one relaying station.
متن کاملExtension of the Coverage Region of Multiple Access Channels by Using a Relay
From practical and theoretical viewpoints, performance analysis of communication systems by using information-theoretic results is important. In this paper, based on our previous work on Multiple Access Channel (MAC) and Multiple Access Relay Channel (MARC), we analyze the impact of a relay on the fundamental wireless communications concept, i.e., coverage region of MARC, as a basic model for u...
متن کاملOn the Sum-Capacity of Degraded Gaussian Multiaccess Relay Channels
The sum-capacity is studied for a K-user degraded Gaussian multiaccess relay channel (MARC) where the multiaccess signal received at the destination from the K sources and relay is a degraded version of the signal received at the relay from all sources, given the transmit signal at the relay. An outer bound on the capacity region is developed using cutset bounds. An achievable rate region is ob...
متن کاملPower Allocation In Cooperative Relay Channels
This paper concerns power allocation in relay-assisted wireless channels for two-hop transmission. First, the transmitter sends the information to both the relay and receiver parts. Next, in the second hop, the transmitter cooperates with the relay to increase the received signal to noise ratio (SNR), assuming the relay makes use of the Amplify and Forward (AF) strategy. Moreover, it is assumed...
متن کاملMaximizing Sum Rates in Gaussian Interference-limited Channels
We study the problem of maximizing sum rates in Gaussian interferencelimited channels. We show that this maximum problem can be restated as a maximization problem of a convex function on a closed convex set. We suggest three algorithms to find the exact and approximate values of the optimal rates.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2009
ISSN: 0018-9448
DOI: 10.1109/tit.2009.2018337